Non-dominated Sorting Genetic Algorithm-ii Based Route Optimization
ثبت نشده
چکیده
NSGA methodology discussed in Section 3.1 suffers from three weaknesses: computational complexity, non-elitist approach and the need to specify a sharing parameter. An improved version of NSGA known as NSGA-II, which resolved the above problems and uses elitism to create a diverse Pareto-optimal front, has been subsequently presented (Deb et al 2002). The main features of NSGA-II are low computational complexity, parameter less diversity preservation, elitism and real valued representation.
منابع مشابه
A knowledge-based NSGA-II approach for scheduling in virtual manufacturing cells
This paper considers the job scheduling problem in virtual manufacturing cells (VMCs) with the goal of minimizing two objectives namely, makespan and total travelling distance. To solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (NSGA-II) and knowledge-based non-dominated sorting genetic algorithm (KBNSGA-II). The difference between these algor...
متن کاملSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کاملModelling and optimization of a tri-objective Transportation-Location-Routing Problem considering route reliability: using MOGWO, MOPSO, MOWCA and NSGA-II
In this research, a tri-objective mathematical model is proposed for the Transportation-Location-Routing problem. The model considers a three-echelon supply chain and aims to minimize total costs, maximize the minimum reliability of the traveled routes and establish a well-balanced set of routes. In order to solve the proposed model, four metaheuristic algorithms, including Multi-Objective Gre...
متن کاملOptimal Distribution System Reconfiguration Using Non-dominated Sorting Genetic Algorithm (NSGA-II)
In this paper, a Non-dominated Sorting Genetic Algorithm-II (NSGA-II) based approach is presented for distribution system reconfiguration. In contrast to the conventional GA based methods, the proposed approach does not require weighting factors for conversion of multi-objective function into an equivalent single objective function. In order to illustrate the performance of the proposed method,...
متن کاملOptimal Placement of Phasor Measurement Units to Maintain CompleteObservability Considering Maximum Reliability by Non-dominated Sorting Genetic Algorithm-II (NSGA-II)
Ever-increasing energy demand has led to geographic expansion of transmission lines and their complexity. In addition, higher reliability is expected in the transmission systemsdue to their vital role in power systems. It is very difficult to realize this goal by conventional monitoring and control methods. Thus, phasor measurement units (PMUs) are used to measure system parameters. Although in...
متن کاملA Non-dominated Sorting Ant Colony Optimization Algorithm Approach to the Bi-objective Multi-vehicle Allocation of Customers to Distribution Centers
Distribution centers (DCs) play important role in maintaining the uninterrupted flow of goods and materials between the manufacturers and their customers.This paper proposes a mathematical model as the bi-objective capacitated multi-vehicle allocation of customers to distribution centers. An evolutionary algorithm named non-dominated sorting ant colony optimization (NSACO) is used as the optimi...
متن کامل